Well-quasi-orderingH-contraction-free graphs
نویسندگان
چکیده
منابع مشابه
Well-quasi-ordering H-contraction-free graphs
A well-quasi-order is an order which contains no infinite decreasing sequence and no infinite collection of incomparable elements. In this paper, we consider graph classes defined by excluding one graph as contraction. More precisely, we give a complete characterization of graphs H such that the class of H-contraction-free graphs is well-quasi-ordered by the contraction relation. This result is...
متن کاملClaw-free graphs. VII. Quasi-line graphs
A graph is a quasi-line graph if for every vertex v, the set of neighbours of v is expressible as the union of two cliques. Such graphs are more general than line graphs, but less general than claw-free graphs. Here we give a construction for all quasi-line graphs; it turns out that there are basically two kinds of connected quasi-line graphs, one a generalization of line graphs, and the other ...
متن کاملWell-Quasi-Ordering Bounded Treewidth Graphs
We show that three subclasses of bounded treewidth graphs are well-quasi-ordered by refinements of the minor order. Specifically, we prove that graphs with bounded feedback-vertex-set are well-quasi-ordered by the topological-minor order, graphs with bounded vertex-covers are well-quasiordered by the subgraph order, and graphs with bounded circumference are well-quasi-ordered by the induced-min...
متن کاملWell-Covered Claw-Free Graphs
We prove the existence of a polynomial time algorithm to tell whether a graph, with no induced subgraph isomorphic to K1.3 , is well covered. A graph is wellcovered if all its maximal independent sets are of the same cardinality. The problem is known to be polynomialy solvable where the input graph is a line graph and it is NP-hard for the larger family of all graphs which do not contain an ind...
متن کاملOn Well Quasi Orders of Free Monoids
The paper investigates down-sets associated to well quasi orders. Of particular language-theoretic interest is the quasi order u s v (resp.u P v) of u being a subword (resp. a Parikh subword) of v, as well as their inverses. We establish a number of results about the regularity and e ective regularity of the down-sets, in particular, a general condition for the e ective regularity of the down-s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2018
ISSN: 0166-218X
DOI: 10.1016/j.dam.2017.02.018